A Generalized Scene Graph
نویسندگان
چکیده
Scene graphs are fundamental data structures for hierarchical scene modeling. The generalized scene graph overcomes various limitations of current scene graph architectures such as support for different 3D rendering systems, integration of multi-pass rendering, and declarative modeling of scenes. The main idea is to separate scene specification from scene evaluation. To specify scenes, scene graph nodes are arranged and equipped with rendering objects, e.g., shapes, attributes, and algorithms. To evaluate scenes, the contents of scene graphs nodes, the rendering objects, are evaluated by rendering engines, which use the algorithm objects to interpret shapes and attributes. Using generalized scene graphs, most real-time rendering techniques for OpenGL and several 3D rendering systems can be integrated in a single scene representation without loosing control over or limiting individual strengths of rendering systems.
منابع مشابه
Graph product of generalized Cayley graphs over polygroups
In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.
متن کاملOn Generalized Coprime Graphs
Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.
متن کاملSplitting the Scene Graph - Using Spatial Relationship Graphs Instead of Scene Graphs in Augmented Reality
Scene graphs have been a core element of 3D graphics since the publication of Inventor. However, in Virtual and Augmented Reality applications, 3D graphics are often interleaved with and controlled by real-world data provided by pose trackers, cameras and other kinds of sensors. In such a setup, the generalized concept of a Spatial Relationship Graph (SRG) might be better suited as an underlyin...
متن کاملThe Generalized Wiener Polarity Index of some Graph Operations
Let G be a simple connected graph. The generalized polarity Wiener index of G is defined as the number of unordered pairs of vertices of G whose distance is k. Some formulas are obtained for computing the generalized polarity Wiener index of the Cartesian product and the tensor product of graphs in this article.
متن کاملSome Fixed Point Theorems for Generalized Contractions in Metric Spaces with a Graph
Jachymski [ Proc. Amer. Math. Soc., 136 (2008), 1359-1373] gave modified version of a Banach fixed point theorem on a metric space endowed with a graph. In the present paper, (G, Φ)-graphic contractions have been de ned by using a comparison function and studied the existence of fixed points. Also, Hardy-Rogers G-contraction have been introduced and some fixed point theorems have been proved. S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000